\contentsline {section}{\numberline {1}Opis problemu}{3}
\contentsline {section}{\numberline {2}Dane wej\IeC {\'s}ciowe}{3}
\contentsline {section}{\numberline {3}Zastosowane wska\IeC {\'z}niki ekonomiczne i utworzone regu\IeC {\l }y}{4}
\contentsline {section}{\numberline {4}Kodowanie i interpretacja ekspert\IeC {\'o}w}{4}
\contentsline {section}{\numberline {5}Funkcja celu}{5}
\contentsline {section}{\numberline {6}Funkcja przystosowania}{5}
\contentsline {section}{\numberline {7}Zastosowana metoda selekcji rodzic\IeC {\'o}w}{5}
\contentsline {section}{\numberline {8}Operatory przeszukiwania}{5}
\contentsline {subsection}{\numberline {8.1}Zastosowane operatory krzy\IeC {\.z}owania}{5}
\contentsline {subsubsection}{\numberline {8.1.1}Krzy\IeC {\.z}owanie half-uniform (HUX)}{6}
\contentsline {subsection}{\numberline {8.2}Zastosowany operator mutacji}{6}
\contentsline {section}{\numberline {9}Zastosowane strategie zamiany pokolenia}{6}
\contentsline {subsection}{\numberline {9.1}Strategia full swap}{6}
\contentsline {subsection}{\numberline {9.2}Strategia replace k worst}{6}
\contentsline {subsection}{\numberline {9.3}Strategia best of pair}{6}
\contentsline {subsection}{\numberline {9.4}Strategia best of current population and children}{7}
\contentsline {section}{\numberline {10}Schemat og\IeC {\'o}lny zastosowanego algorytmu}{7}
\contentsline {section}{\numberline {11}Obs\IeC {\l }uga programu}{7}
\contentsline {subsection}{\numberline {11.1}Kompilacja i uruchamianie}{7}
\contentsline {subsection}{\numberline {11.2}Parametry konstruktora klasy algorytmu}{8}
\contentsline {section}{\numberline {12}Testy}{9}
\contentsline {subsection}{\numberline {12.1}Test nr. 1}{9}
\contentsline {subsection}{\numberline {12.2}Test nr. 2}{13}
\contentsline {subsection}{\numberline {12.3}Test nr. 3}{14}
\contentsline {subsection}{\numberline {12.4}Test nr. 4}{17}
\contentsline {subsection}{\numberline {12.5}Test nr. 5}{20}
\contentsline {subsection}{\numberline {12.6}Wnioski z testowania}{22}
